Intervals and factors in the Bruhat order
نویسنده
چکیده
In this paper we study those generic intervals in the Bruhat order of the symmetric group that are isomorphic to the principal order ideal of a permutation w, and consider when the minimum and maximum elements of those intervals are related by a certain property of their reduced words. We show that the property does not hold when w is a decomposable permutation, and that the property always holds when w is the longest permutation.
منابع مشابه
The cd-index of Bruhat Intervals
We study flag enumeration in intervals in the Bruhat order on a Coxeter group by means of a structural recursion on intervals in the Bruhat order. The recursion gives the isomorphism type of a Bruhat interval in terms of smaller intervals, using basic geometric operations which preserve PL sphericity and have a simple effect on the cd-index. This leads to a new proof that Bruhat intervals are P...
متن کاملBruhat Intervals and Polyhedral Cones
Lecture notes by Matthew Dyer for lectures at the workshop “Coxeter groups and convex geometry.” 1. Root labelled Bruhat graph 1.1. Bruhat order. Let (W,S) be a Coxeter group. Bruhat order is the partial order defined by the following proposition; see [3] and [13] for more details. Proposition. There is a partial order ≤ on W with the following properties. Let w ∈ W and w = s1 . . . sn, n = l0(...
متن کاملComputing the Size of Intervals in the Weak Bruhat Order
The weak Bruhat order on Sn is the partial order ≺ so that σ ≺ τ whenever the set of inversions of σ is a subset of the set of inversions of τ . We investigate the time complexity of computing the size of intervals with respect to ≺. Using relationships between two-dimensional posets and the weak Bruhat order, we show that the size of the interval [σ1, σ2] can be computed in polynomial time whe...
متن کاملThe Complete cd-Index of Dihedral and Universal Coxeter Groups
We present a description, including a characterization, of the complete cd-index of dihedral intervals. Furthermore, we describe a method to compute the complete cd-index of intervals in universal Coxeter groups. To obtain such descriptions, we consider Bruhat intervals for which Björner and Wachs’s CL-labeling can be extended to paths of different lengths in the Bruhat graph. While such an ext...
متن کاملSoergel Bimodules and the Shape of Bruhat Intervals
Given an element w of a Coxeter group, let ai(w) be the number of elements less than w in Bruhat order. A theorem of Björner and Ekedahl states that if W is crystallographic, then ai(w) ≤ aj(w) for all 0 ≤ i < j ≤ `(w) − i. Their proof uses the hard Lefschetz property in intersection cohomology. In this note we extend Björner and Ekedahl’s theorem to all Coxeter groups using the hard Lefschetz ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics & Theoretical Computer Science
دوره 17 شماره
صفحات -
تاریخ انتشار 2015